19 Covariance Matrices

Recall last note, Covariance matrix is defined as Cov(X)=E[(Xμ)(Xμ)T],X,μRn.
For all fixed vRn, vTCov(X)v=E[vT(Xμ)(Xμ)v]=E[Y2]0,
here Y=vT(Xμ)R.

Positive (semi-)definite matrix

Let MRn×n be a real-valued symmetric n×n matrix, i.e. M=MT.

  1. M is called positive definite, if any non-zero vector x:xTMx>0.
    • All eigenvalues are real and positive.
    • M is non-singular (invertible).
  2. M is called positive semi-definite, if xTMx0,xRn.
    • All eigenvalues are real and non-negative.

Thus covariance matrix must be positive semi-definite.

Theorem

  1. M is positive semi-definite if and only if M=AAT where A is some real square matrix.
  2. M is positive definite if and only if M=AAT where A is some real non-singular square matrix.

Let Σ be a positive semi-definite matrix, and let A be its square-root matrix. Then Σ=Cov(X), where X=AZ and ZNn(0,Σn).
More generally,

When Σ is non-singular, Σ is invertible. By the proof we have Σ=QΛQT, soΣ1=QΛ1QT=QΛ12Λ12QT=QΛ12QTΣ12QΛ12QTΣ12.
Where Λ1=diag{λ11,,λn1},Λ12=diag{λ112,,λn12}.
So if xNn(μ,Σ), where Σ is positive definite, then we can do standardization Z=Σ12(Xμ)Nn(0,In).


MGF


Multivariate normal & χ2 distribution

Idempotent

A square matrix M is said to be idempotent if M2=M.

Fact

MRn×m is a symmetric and idempotent matrix of rank rn iffM=q1q1T++qrqrT, where {q1,,qr} are r orthogonal vectors in Rn.

Theorem

Suppose XNn(μ,In) and M is an n×n symmetric matrix. If M is idempotent with rank r, then (Xμ)TM(Xμ)χr2.

In fact, the converse is also true.

The above result has many applications in Statistics.
E.g., X1,,Xni.i.dN(μ,σ2). Sn=X1++Xn. Then, the above result can be used to show1σ2i=1n(XiSnn)2χn12.


Multivariate CLT

(Recall 1-dim CLT.)

Multivariate Central Limit Theorem

Let X1,,Xn be a sequence of iid Rk-valued random vectors whereXi=[Xi1Xik],E[Xi]=μ,E[Xij2]<,Cov(Xi)=V,1jk.
Let Sn=X1++Xn. Then n(Snnμ)dNk(0,V),n.
If V is non-singular, thennV12(Snnμ)dNk(0,Ik),n.

Pearson

i=1k(Cn,jnpj)2npjdχk12,n.

Fact: M is idempotent and symmetric with rank(M)=k1. (Apply the theorem. )